Subquadratic Multiplication Using Optimal Normal Bases

نویسندگان

  • H. Fan
  • M. A. Hasan
چکیده

Based on a recently proposed Toeplitz matrix-vector product approach, a subquadratic computational complexity scheme is presented for multiplications in binary extended finite fields using Type I and II optimal normal bases.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

New Complexity Results for Field Multiplication using Optimal Normal Bases and Block Recombination

In this article, we propose new schemes for subquadratic arithmetic complexity multiplication in binary fields using optimal normal bases. The schemes are based on a recently proposed method known as block recombination, which efficiently computes the sum of two products of Toeplitz matrices and vectors. Specifically, here we take advantage of some structural properties of the matrices and vect...

متن کامل

Subquadratic Space Complexity Multiplication over Binary Fields with Dickson Polynomial Representation

We study Dickson bases for binary field representation. Such representation seems interesting when no optimal normal basis exists for the field. We express the product of two elements as Toeplitz or Hankel matrix vector product. This provides a parallel multiplier which is subquadratic in space and logarithmic in time.

متن کامل

Two Software Normal Basis Multiplication Algorithms for GF(2n)

In this paper, two different normal basis multiplication algorithms for software implementation are proposed over GF(2). The first algorithm is suitable for high complexity normal bases and the second algorithm is fast for type-I optimal normal bases and low complexity normal bases. The ANSI C source program is also included in this paper. Index Terms Finite field, normal basis, multiplication ...

متن کامل

Revisiting Finite Field Multiplication Using Dickson Bases

Dickson bases have recently been introduced in [1] for finite field arithmetic. Such a basis exists for any extension field and under certain conditions it represents a permutation of type II optimal normal bases. In this paper Dickson bases are developed using simpler mathematical terms and their properties are discussed. An algorithm/architecture based on the model presented in [1] is develop...

متن کامل

Efficient Multiplication Using Type 2 Optimal Normal Bases

In this paper we propose a new structure for multiplication using optimal normal bases of type 2. The multiplier uses an efficient linear transformation to convert the normal basis representations of elements of Fqn to suitable polynomials of degree at most n over Fq. These polynomials are multiplied using any method which is suitable for the implementation platform, then the product is convert...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006